High Saturation Complete Graph Approach for EC Point Decomposition and ECDL Problem

One of the key questions in contemporary applied cryptography is whether there exist an efficient algorithm for solving the discrete logarithm problem in elliptic curves. The primary approach for this problem is to try to solve a certain system of polynomial equations [44]. Current attempts try to solve them directly with existing software tools which does not work well due to their very loosely connected topology [43, 40] and illusory reliance on degree falls [35]. A deeper reflection on what makes systems of algebraic equations efficiently solvable is missing. In this paper we propose a new approach for solving this type of polynomial systems which is radically different than current approaches, cf. [43, 40]. We carefully engineer systems of equations with excessively dense topology obtained from a complete clique/biclique graphs and hypergraphs and unique special characteristics. We construct a sequence of systems of equations with a parameter K and argue that asymptotically when K grows the system of equations achieves a high level of saturation with limK→∞ F/T = 1 which allows to reduce the “regularity degree” and makes that polynomial equations over finite fields may become efficiently solvable.